Automata-Style Proof of Voloch's Result on Transcendence
نویسنده
چکیده
For more on the Tate curve (which we will not use directly) and for standard facts on modular forms (which we will use later), see [S, Chap. 5; M. Chap. 1], respectively. Voloch's nice proof involved approximating q by algebraic quantities and getting a contradiction by analyzing the Galois action using Igusa's theorem. We offer below a proof based on the criterion of algebraicity due to Christol. In [V] Voloch also proves transcendence of parameters of algebraic points by his method. It is unlikely that our method yields this easily. article no. 0061
منابع مشابه
Automata and Transcendence of the Tate Period in Finite Characteristic
Using the techniques of automata theory, we give another proof of the function field analogue of the Mahler-Manin conjecture and prove transcendence results for the power series associated to higher divisor functions σk(n) = ∑ d|n d k. Let p be a prime number, and let k be an algebraic closure of Fp. Let q be a variable and consider a4, a6 ∈ k[[q]] defined by
متن کاملA Complete Axiomatisation for Timed Automata
A proof system of timed bisimulation equivalence for timed automata is presented, based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. The proof...
متن کاملTranscendence in Positive Characteristic and Special Values of Hypergeometric Functions
We prove a simple transcendence criterion suitable for function field arithmetic. We apply it to show the transcendence of special values at non-zero rational arguments (or more generally, at algebraic arguments which generate extension of the rational function field with less than q places at infinity) of the entire hypergeometric functions in the function field (over Fq) context, and to obtai...
متن کاملAutomata Methods in Transcendence
The purpose of this expository article is to explain diverse new tools that automata theory provides to tackle transcendence problems in function field arithmetic. We collect and explain various useful results scattered in computer science, formal languages, logic literature and explain how they can be fruitfully used in number theory, dealing with transcendence, refined transcendence and class...
متن کاملA Proof System for Timed Automata
A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimula-tion and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996